The Orthogonal Art Gallery Theorem with Constrained Guards
نویسندگان
چکیده
Let P be an orthogonal polygon with n vertices, and let V ∗ and E∗ be specified sets of vertices and edges of P . We prove that P has a guard set of cardinality at most ⌊(n+ 3|V ∗|+ 2|E∗|) /4⌋ that includes each vertex in V ∗ and at least one point of each edge in E∗. Our bound is sharp and reduces to the orthogonal art gallery theorem of Kahn, Klawe and Kleitman when V ∗ and E∗ are empty.
منابع مشابه
Special Guards in Chromatic Art Gallery
We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards so that these modern guards can visit α-degree of their surroundings. If α is between 0 and 180 degree, we demonstrate that the strong chromatic guarding number is constant. Then we use orthogonal 90-degree guards for...
متن کاملThe Art Gallery Theorem for Polyominoes
We explore the art gallery problem for the special case that the domain (gallery) P is an mpolyomino, a polyform whose cells are m unit squares. We study the combinatorics of guarding polyominoes in terms of the parameter m, in contrast with the traditional parameter n, the number of vertices of P . In particular, we show that ⌊ 3 ⌋ point guards are always sufficient and sometimes necessary to ...
متن کاملGuarding and Searching Polyhedra
Guarding and searching problems have been of fundamental interest since the early years of Computational Geometry. Both are well-developed areas of research and have been thoroughly studied in planar polygonal settings. In this thesis we tackle the Art Gallery Problem and the Searchlight Scheduling Problem in 3-dimensional polyhedral environments, putting special emphasis on edge guards and ort...
متن کاملColoring Variations of the Art Gallery Problem
The art gallery problem [2] asks for the smallest possible size of a point set S (the guards) to completely guard the interior of a simple polygon P (the art gallery). This thesis treats variations of the original problem that arise when we introduce a coloring of the guards. Rather than asking for the minimum number of guards we ask for the minimum number of colors. In [4] L. H. Erickson and S...
متن کاملMobile vs. point guards
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using “rectangular vision”. We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Further...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 54 شماره
صفحات -
تاریخ انتشار 2016